Debugging Static Analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Debugging Static Analysis

To detect and x bugs and security vulnerabilities, software companies use static analysis as part of the development process. However, static analysis code itself is also prone to bugs. To ensure a consistent level of precision, as analyzed programs grow more complex, a static analysis has to handle more code constructs, frameworks, and libraries that the programs use. While more complex analys...

متن کامل

Eeective Static Debugging via Componential Set-based Analysis Abstract Eeective Static Debugging via Componential Set-based Analysis

E ective Static Debugging via Componential Set-Based Analysis by Cormac Flanagan Sophisticated software systems are inherently complex. Understanding, debugging and maintaining such systems requires inferring high-level characteristics of the system's behavior from a myriad of low-level details. For large systems, this quickly becomes an extremely di cult task. MrSpidey is a static debugger tha...

متن کامل

Automated Software Debugging Using Hybrid Static/Dynamic Analysis

Title of dissertation: AUTOMATED SOFTWARE DEBUGGING USING HYBRID STATIC/DYNAMIC ANALYSIS Ethar Elsaka, Doctor of Philosophy, 2016 Dissertation directed by: Professor Atif Memon Department of Computer Science With the increasing complexity of today’s software, the software development process is becoming highly time and resource consuming. The increasing number of software configurations, input ...

متن کامل

ective Static Debugging via Componential Set Based Analysis

E ective Static Debugging via Componential Set Based Analysis

متن کامل

A Static Analysis for Program Understanding and Debugging

This paper presents a static pointer analysis technique for a subset of C. The tool supports user-defined assertions inserted in the body of the program. Assertions are of two kinds: static assertions automatically verified by the analyser, and hypothetical assertions treated as assumptions by the analyser. The technique deals with recursive data structures and it is accurate enough to handle c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Software Engineering

سال: 2020

ISSN: 0098-5589,1939-3520,2326-3881

DOI: 10.1109/tse.2018.2868349